Scattered Linear Sets and Pseudoreguli
نویسندگان
چکیده
منابع مشابه
Scattered Linear Sets and Pseudoreguli
In this paper, we show that one can associate a pseudoregulus with every scattered linear set of rank 3n in PG(2n − 1, q3). We construct a scattered linear set having a given pseudoregulus as associated pseudoregulus and prove that there are q − 1 different scattered linear sets that have the same associated pseudoregulus. Finally, we give a characterisation of reguli and pseudoreguli in PG(3, ...
متن کاملComplementation of Rational Sets on Countable Scattered Linear Orderings
In a preceding paper (Bruyère and Carton, automata on linear orderings, MFCS’01), automata have been introduced for words indexed by linear orderings. These automata are a generalization of automata for finite, infinite, bi-infinite and even transfinite words studied by Büchi. Kleene’s theorem has been generalized to these words. We prove that rational sets of words on countable scattered linea...
متن کاملFq-pseudoreguli of PG(3, q3) and scattered semifields of order q6
In this paper, we study rank two semifields of order q that are of scattered type. The known examples of such semifields are some Knuth semifields, some Generalized Twisted Fields and the semifields recently constructed in [12] for q ≡ 1(mod 3). Here, we construct new infinite families of rank two scattered semifields for any q odd prime power, with q ≡ 1(mod 3); for any q = 2, such that h ≡ 1(...
متن کاملScattered Algebraic Linear Orderings
An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general Mezei-Wright type result, algebraic linear orderings are exactly those isomorphic to the linear ordering of the leaves of an algebraic tree. Moreover, using...
متن کاملScattered Context-Free Linear Orderings
We show that it is decidable in exponential time whether the lexicographic ordering of a context-free language is scattered, or a wellordering.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2013
ISSN: 1077-8926
DOI: 10.37236/2871